Tactical Planning using Heuristics
نویسندگان
چکیده
Modern transportation problems are highly dynamic and time critical. A planning system for transportation problems must therefore include efficient and flexible planning and replanning strategies. In this paper we introduce a general agent-based framework for highly dynamic order-based transportation planning problems where a tactical planner and several operational planners (one for each transport agent) are distinguished. In particular we discuss the role of the tactical planner responsible for dynamic task allocation of orders and we present some preliminary results of task allocation heuristics in such dynamic environments.
منابع مشابه
Heuristics for Time Slot Management: A Periodic Vehicle Routing Problem View
In this study, we consider a tactical problem where a time slot combination for delivery service over a given planning horizon must be selected in each zone of a geographical area. Based on the selected time slot combinations, routes are then constructed for the fleet of delivery vehicles for each period of the planning horizon. The routing plan serves as a blueprint for the following operation...
متن کاملTactical Planning in Healthcare using Approximate Dynamic Programming
Tactical planning of resources in hospitals concerns elective patient admission planning and the intermediate term allocation of resource capacities. Its main objectives are to achieve equitable access for patients, to serve the strategically agreed number of patients, and to use resources efficiently. We propose a method to develop a tactical resource allocation and patient admission plan that...
متن کاملAn Integrated Approach to Tactical Logistics Network Optimization ∗
We propose a new mathematical model for the optimization of logistics networks on the tactical level. Main features include accurately modelled tariff structures and the integration of spatial and temporal consolidation effects via a cyclic pattern expansion. By using several graph-based gadgets, we are able to formulate our problem as a capacitated network design problem. To solve the model, w...
متن کاملRobust static planning tool for military village search missions: model and heuristics
In the contemporary military environment, making decisions on how to best utilize resources to accomplish a mission with a set of specified constraints is difficult. A Cordon and Search of a village (a.k.a. village search) is an example of such a mission. Leaders must plan the mission, assigning assets (e.g. soldiers, robots, unmanned aerial vehicles, military working dogs) to accomplish the gi...
متن کاملPatient admission planning using Approximate Dynamic Programming
Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans. Our method is developed in an Approximate Dynamic Programming (ADP) framework and copes with mult...
متن کامل